package cn.huava.leetcode75;

/**
 * <a
 * href="https://leetcode.com/problems/house-robber/?envType=study-plan-v2&envId=leetcode-75">198.
 * House Robber</a> <br>
 *
 * @author Camio1945
 */
public class P61HouseRobber {
  public int rob(int[] nums) {
    int n = nums.length;
    if (n == 1) {
      return nums[0];
    }
    int[] dp = new int[n];
    dp[0] = nums[0];
    dp[1] = Math.max(nums[0], nums[1]);
    for (int i = 2; i < n; i++) {
      dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
    }
    return dp[n - 1];
  }
}
